Static Analysis with Set-Closure in Secrecy

نویسندگان

  • Woosuk Lee
  • Hyunsook Hong
  • Kwangkeun Yi
  • Jung Hee Cheon
چکیده

We report that the homomorphic encryption scheme can unleash the possibility of static analysis of encrypted programs. Static analysis in cipher-world is desirable in the static-analysis-as-a-service setting, because it allows the program owners to encrypt and upload their programs to the static analysis service while the service provider can still analyze the encrypted programs without decrypting them. Only the owner of the decryption key (the program owner) is able to decrypt the analysis result. As a concrete example, we describe how to perform inclusion-based pointer analysis in secrecy. In our method, a somewhat homomorphic encryption scheme of depth O(logm) is able to evaluate a simple pointer analysis with O(logm) homomorphic matrix multiplications, for the number m of pointer variables when the maximal pointer level is bounded. We also demonstrate the viability of our method by implementing the pointer analysis in secrecy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Handling exp, × (and Timestamps) in Protocol Analysis

We present a static analysis technique for the verification of cryptographic protocols, specified in a process calculus. Rather than assuming a specific, fixed set of cryptographic primitives, we only require them to be specified through a term rewriting system, with no restrictions. Examples are provided to support our analysis. First, we tackle forward secrecy for a Diffie-Hellman-based proto...

متن کامل

The CASPA Tool: Causality-Based Abstraction for Security Protocol Analysis

CASPA constitutes a push-button tool for automatically proving secrecy and authenticity properties of cryptographic protocols. The tool is grounded on a novel technique for causality-based abstraction of protocol executions that allows establishing proofs of security for an unbounded number of concurrent protocol executions in an automated manner. We demonstrate the expressiveness and efficienc...

متن کامل

Secrecy of Communications in Data Transmission by Impulses with Unknown Moments of Appearance and Disappearance

We carried out a comparative analysis of the algorithms for detecting a rectangular impulse against Gaussian white noise under either authorized or unauthorized access to the transmitted data. We presupposed that for data transmission the binary communication system is used and that the useful information in the data is whether the signal is present or absent. The case is that unauthorized acce...

متن کامل

Three dimensional static and dynamic analysis of thick plates by the meshless local Petrov-Galerkin (MLPG) method under different loading conditions

In this paper, three dimensional (3D) static and dynamic analysis of thick plates based on the Meshless Local Petrov-Galerkin (MLPG) is presented. Using the kinematics of a three-dimensional continuum, the local weak form of the equilibrium equations is derived. A weak formulation for the set of governing equations is transformed into local integral equations on local sub-domains by using a uni...

متن کامل

New Functions for Secrecy on Real Protocols

In this paper, we present new functions for secrecy in cryptographic protocols:the witnessfunctions. A witness-function is a protocol-dependent function that is able to prove the correctness of a protocol through its growth. It bases its calculation on the static part of a message only in a role-based specification by using derivation techniques. We show here how to build them. Then, we run an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015